A new algorithm for sparse suffix trees (2011)
Source: Proceedings. Conference titles: Brazilian Symposium on Bioinformatics - BSB. Unidade: IME
Subjects: ALGORITMOS PARA PROCESSAMENTO, BIOINFORMÁTICA, PROCESSAMENTO DE LINGUAGEM NATURAL
ABNT
SACOMOTO, Gustavo Akio Tominaga e LAGO, Alair Pereira do. A new algorithm for sparse suffix trees. 2011, Anais.. Cham: Springer, 2011. Disponível em: https://doi.org/10.1007/978-3-642-22825-4_5. Acesso em: 28 abr. 2024.APA
Sacomoto, G. A. T., & Lago, A. P. do. (2011). A new algorithm for sparse suffix trees. In Proceedings. Cham: Springer. doi:10.1007/978-3-642-22825-4_5NLM
Sacomoto GAT, Lago AP do. A new algorithm for sparse suffix trees [Internet]. Proceedings. 2011 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/978-3-642-22825-4_5Vancouver
Sacomoto GAT, Lago AP do. A new algorithm for sparse suffix trees [Internet]. Proceedings. 2011 ;[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/978-3-642-22825-4_5